Is the Planck’s Length the Shortest Meaningful Length in Space-time?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest Path Problem with Gamma Probability Distribution Arc Length

We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.

متن کامل

The Expected Length of a Shortest Path

Davis, R. and A. Prieditis, The expected length of a shortest path, Information Processing Letters 46 (1993) 135-141. We derive an exact summation formula and a closed-form approximation for the expected length of a shortest path for a complete graph where the arc lengths are independent and exponentially distributed random variables. Experimental data validates both results. The property of co...

متن کامل

Computing the length of the shortest telomere in the nucleus.

The telomere length can either be shortened or elongated by an enzyme called telomerase after each cell division. Interestingly, the shortest telomere is involved in controlling the ability of a cell to divide. Yet, its dynamics remains elusive. We present here a stochastic approach where we model this dynamics using a Markov jump process. We solve the forward Fokker-Planck equation to obtain t...

متن کامل

Estimating Shortest Circuit Path Length Complexity

When binary decision diagrams are formed from uniformly distributed Monte Carlo data for a large number of variables, the complexity of the decision diagrams exhibits a predictable relationship to the number of variables and minterms. In the present work, a neural network model has been used to analyze the pattern of shortest path length for larger number of Monte Carlo data points. The neural ...

متن کامل

The Length of a Shortest Geodesic Loop at a Point

In this paper we prove that given a point p ∈ M, where M is a closed Riemannian manifold of dimension n, the length of a shortest geodesic loop lp(M ) at this point is bounded above by 2nd, where d is the diameter of M. Moreover, we show that on a closed simply connected Riemannian manifold M with a nontrivial second homotopy group there either exist at least three geodesic loops of length less...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of New Technology and Research

سال: 2019

ISSN: 2454-4116

DOI: 10.31871/ijntr.5.11.21